منابع مشابه
Incidence dominating numbers of graphs
In this paper, the concept of incidence domination number of graphs is introduced and the incidence dominating set and the incidence domination number of some particular graphs such as paths, cycles, wheels, complete graphs and stars are studied.
متن کاملDominating sequences in graphs
A sequence of vertices in a graph G is called a legal dominating sequence if every vertex in the sequence dominates at least one vertex not dominated by those vertices that precede it, and at the end all vertices of G are dominated. While the length of a shortest such sequence is the domination number of G, in this paper we investigate legal dominating sequences of maximum length, which we call...
متن کاملHereditary dominating pair graphs
An asteroidal triple (AT) is a set of vertices such that each pair of vertices is joined by a path that avoids the neighborhood of the third. Every AT-free graph contains a dominating pair, a pair of vertices such that for every path between them, every vertex of the graph is within distance one of the path. We say that a graph is a hereditary dominating pair (HDP) graph if each of its connecte...
متن کاملDominating Pair Graphs
A pair of vertices of a graph is called a dominating pair if the vertex set of every path between these two vertices is a dominating set of the graph. A graph is a weak dominating pair graph if it has a dominating pair. Further, a graph is called a dominating pair graph if each of its connected induced subgraphs is a weak dominating pair graph. Dominating pair graphs form a class of graphs cont...
متن کاملDominating cliques in graphs
A set of vertices is a dominating set in a graph if every vertex not in the dominating set is adjacent to one or more vertices in the dominating set. A dominating clique is a dominating set that induces a complete subgraph. Forbidden subgraph conditions sufficient to imply the existence of a dominating clique are given. For certain classes of graphs, a polynomial algorithm is given for finding ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2020
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-020-02221-5